Improved upper bounds on longest-path and maximal-subdivision transversals
نویسندگان
چکیده
Let G be a connected graph on n vertices. The Gallai number Gal(G) of is the size smallest set vertices that meets every maximum path in G. Grünbaum constructed with Gal(G)=3. Very recently, Long, Milans, and Munaro, proved Gal(G)≤8n3/4. This was first sub-linear upper bound terms n. We improve their to Gal(G)≤5n2/3. also tighten more general result Long et al. For multigraph M, we prove if L(M,G) M-subdivisions pairwise intersecting n≥m6, then has at most 5n2/3 Q∈L(M,G)
منابع مشابه
Transversals of Longest Paths
Let lpt(G) be the minimum cardinality of a set of vertices that intersects all longest paths in a graph G. Let ω(G) be the size of a maximum clique in G, and tw(G) be the treewidth of G. We prove that lpt(G) ≤ max{1,ω(G)− 2} when G is a connected chordal graph; that lpt(G) = 1 when G is a connected bipartite permutation graph or a connected full substar graph; and that lpt(G) ≤ tw(G) for any co...
متن کاملImproved Upper Bounds on all Maximal $\alpha$-gapped Repeats and Palindromes
We show that the number of all maximal α-gapped repeats and palindromes of a word of length n is at most 3(π/6 + 5/2)αn and 7(π/6 + 1/2)αn − 5n− 1, respectively.
متن کاملImproved upper bounds on sizes of codes
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is the Johnson bound. We give a new upper bound which is at least as good as the Johnson bound for all values of and , and for each there are infinitely many values of for which the new bound is better than the Johnson bo...
متن کاملTransversals of Longest Paths and Cycles
Let G be a graph of order n. Let lpt(G) be the minimum cardinality of a set X of vertices of G such that X intersects every longest path of G and define lct(G) analogously for cycles instead of paths. We prove that • lpt(G) 6 ⌈
متن کاملImproved upper bounds for partial spreads
A partial (k−1)-spread in PG(n−1, q) is a collection of (k−1)-dimensional subspaces with trivial intersection such that each point is covered exactly once. So far the maximum size of a partial (k − 1)-spread in PG(n− 1, q) was know for the cases n ≡ 0 (mod k), n ≡ 1 (mod k) and n ≡ 2 (mod k) with the additional requirements q = 2 and k = 3. We completely resolve the case n ≡ 2 (mod k) for the b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2023.113514